Average degrees of edge-chromatic critical graphs
نویسندگان
چکیده
منابع مشابه
Edge Chromatic 5-Critical Graphs
In this paper, we study the structure of 5-critical graphs in terms of their size. In particular, we have obtained bounds for the number of major vertices in several classes of 5-critical graphs, that are stronger than the existing bounds.
متن کاملThe average degree of an edge-chromatic critical graph
A graph G with maximum degree and edge chromatic number ′(G)> is edge-critical if ′(G− e)= for every edge e of G. New lower bounds are given for the average degree of an edge-critical graph, which improve on the best bounds previously known for most values of . Examples of edge-critical graphs are also given. In almost all cases, there remains a large gap between the best lower bound known and ...
متن کاملEdge coloring of graphs with small average degrees
Let G be a simple graph with average degree . d and maximum degree . It is proved, in this paper that G is not critical if . d6 6 and ¿ 8, or . d6 20 3 and ¿ 9. This result generalizes earlier results of Vizing (Metody Diskret. Analiz. 5 (1965) 9), Mel’nikov (Mat. Zametki 7 (1970) 671) and Hind and Zhao (Discrete Math. 190 (1998) 107) and Yan and Zhao (Graphs Combin. 16 (2) (2000) 245). It also...
متن کاملA Class of Edge Critical 4-Chromatic Graphs
We consider several constructions of edge critical 4-chromatic graphs which can be written as the union of a bipartite graph and a matching. In particular we construct such a graph G with each of the following properties: G can be contracted to a given critical 4-chromatic graph; for each n;,: 7, G has n vertices and three matching edges (it is also 8n ) shown that such graphs must have at leas...
متن کاملRemarks on the size of critical edge-chromatic graphs
We give new lower bounds for the size of A-critical edge-chromatic graphs when 6~<A ~<21. 1. I n t r o d u c t i o n All graphs we consider are undirected and have neither loops nor multiple edges. We denote the vertex set of a graph G by V(G) and the edge set by E(G). The order of G is I V(G)I and the size of G is IE(G)I. We denote the degree of a vertex v in G by de(v) and the maximum degree ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2019
ISSN: 0012-365X
DOI: 10.1016/j.disc.2019.02.014